Rewriting preserving recognizability of finite tree languages

Rewriting preserving recognizability of finite tree languages

We show that left-linear generalized semi-monadic TRSs effectively preserving recognizability of finite tree languages (are EPRF-TRSs). We show that reachability, joinability, and local confluence are decidable for EPRFTRSs.

Bottom-Up Rewriting Is Inverse Recognizability Preserving

Algebraic recognizability of regular tree languages

We propose a new algebraic framework to discuss and classify recognizable tree languages, and to characterize interesting classes of such languages. Our algebraic tool, called preclones, encompasses the classical notion of syntactic Σ-algebra or minimal tree automaton, but adds new expressivity to it. The main result in this paper is a variety theorem à la Eilenberg, but we also discuss importa...

Layered Transducing Term Rewriting System and Its Recognizability Preserving Property

A term rewriting system which effectively preserves recognizability (EPR-TRS) has good mathematical properties. In this paper, a new subclass of TRSs, layered transducing TRSs (LT-TRSs) is defined and its recognizability preserving property is discussed. The class of LT-TRSs contains some EPRTRSs, e.g., {f(x) → f(g(x))} which do not belong to any of the known decidable subclasses of EPR-TRSs. B...

Algebraic Recognizability of Languages

Recognizable languages of finite words are part of every computer science cursus, and they are routinely described as a cornerstone for applications and for theory. We would like to briefly explore why that is, and how this word-related notion extends to more complex models, such as those developed for modeling distributed or timed behaviors. In the beginning was the Word. . . Recognizable lang...